MSF: Modulated Sub-graph Finder

Connected Sub-graph Detection

We characterize the family of connected subgraphs in terms of linear matrix inequalities (LMI) with additional integrality constraints. We then show that convex relaxations of the integral LMI lead to parameterization of all weighted connected subgraphs. These developments allow for optimizing arbitrary graph functionals under connectivity constraints. For concreteness we consider the connected...

Sub-Graphs of Complete Graph

In the complete graph K2m+3 for m ≥ 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m ≥ 2 . The various structures of the form H(2m+3, 6m+3) for m ≥ 2 are found and some of them are observed to give some forms of metal atom cluster compound of chemistry . Finally, we establish an algorithm to solve the traveling salesman problem when ...

Graph Attribution Through Sub-Graphs

We offer an alternative to the standard formalisation of attributed graphs. We propose to represent an attributed graph as a graph with a marked sub-graph, in which the sub-graph represents the data domain, rather than as a tuple of graph and algebra. This is a general construction which can be shown to preserve adhesiveness of categories; it has the advantage of uniformity and gives more flexi...

The Preprojective Algebra of a Modulated Graph

Uncertain Attribute Graph Sub-Graph Isomorphism and its Determination Algorithm

The expectative sub-graph isomorphism of uncertain attribute graph is based on the analysis of complex network structure and the characteristic of uncertain attribute graph. The expectative sub-graph isomorphism of uncertain attribute graph is only one threshold value as constraint conditions. The method is simple, but the computation is large amount. Therefore, this paper brings in the definit...